KERALA UNIVERSITY Class 7 information theory and coding Question Paper 2013

Practice authentic previous year questions for better exam preparation.

Sample Questions

Define mutual information $X(X ; Y)$ between two random variable X and Y .
Define efficiency and redundancy of a source code.
In a binary Huffman code, there will always be two codewords of maximum length. Why?
Write down channel transition matrix of a binary erasure channel.
Define rate distortion function.